#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1010;

int n;
vector<int> hobby[N];
int p[N];
int cnt[N];

int find(int x) {
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}

// 并查集
inline void solution() {
    cin >> n;
    for (int i = 0; i < n; i ++ ) {
        int cnt;
        scanf("%d:", &cnt);
        while (cnt -- ) {
            int idx;
            cin >> idx;
            hobby[idx].push_back(i);
        }
    }

    for (int i = 0; i < n; i ++ ) p[i] = i;

    for (int i = 0; i < N; i ++ )
        for (int j = 1; j < (int)hobby[i].size(); j ++ ) 
        {
            int a = hobby[i][0], b = hobby[i][j];
            p[find(b)] = find(a);
        }
    
    for (int i = 0; i < n; i ++ ) cnt[find(i)] ++ ;

    sort(cnt, cnt + n, greater<int>());

    int k = 0;
    while (cnt[k]) k ++ ;

    cout << k << endl;
    cout << cnt[0];
    for (int i = 1; i < k; i ++ ) cout << " " << cnt[i];
    cout << endl;
    
}

int main() {
    freopen("input.txt", "r", stdin);
    // quickread();
    solution();
    return 0;
}